Jason Induction of Logical Decision Trees: A Learning Library and Its Application to Commitment
نویسندگان
چکیده
This paper presents JILDT (Jason Induction of Logical Decision Trees), a library that defines two learning agent classes for Jason, the well known java-based implementation of AgentSpeak(L). Agents defined as instances of JILDT can learn about their reasons to adopt intentions performing first-order induction of decision trees. A set of plans and actions are defined in the library for collecting training examples of executed intentions, labeling them as succeeded or failed executions, computing the target language for the induction, and using the induced trees to modify accordingly the plans of the learning agents. The library is tested studying commitment: A simple problem in a world of blocks is used to compare the behavior of a default Jason agent that does not reconsider his intentions, unless they fail; a learning agent that reconsiders when to adopt intentions by experience; and a single-minded agent that also drops intentions when this is rational. Results are very promissory for both, justifying a formal theory of single-mind commitment based on learning, as well as enhancing the adopted inductive process.
منابع مشابه
Top-down induction of logical decision trees
Top-down induction of decison trees (TDIDT) is a very popular machine learning technique. Up till now, it has mainly used for propositional learning, but seldomly for relational learning or inductive logic programming. The main contribution of this paper is the introduction of logic decision trees, which make it possible to use TDIDT in inductive logic programming. An implementation of this top...
متن کاملEffectiveness of the Self-determination Educational Package on Self-directed Learning and Decision-making Styles among High School Students
Introduction: The purpose of this study was to develop a self-determination educational package and determine its effectiveness on Self-Directed Learning and Decision making Styles of high school students. Methods: The research method was semi-experimental with pre-test, post-test with the control group and follow up. At first, self-determination educational package was compiled using library s...
متن کاملI-22: Decision Trees for Identifying Predictor of Treatment Effectiveness in Clinical Trials and Its Application to Ovulation in a Study of Women with Polycystic Ovary Syndrome
Background: Double-blind, randomized clinical trials are the preferred approach to demonstrate the effectiveness of one treatment against another. The comparison is, however, made on the average group effects. While patients and clinicians have always struggled to understand why patients respond differently to the same treatment, and while much hope has been held out for the nascent field of pr...
متن کاملRevising and Learning First-Order Theories
We study and implement algorithms to revise and learn first-order logical theories, written in clausal form (as in Prolog), describing multiple concepts, and employing negation. These algorithms derive ideas from decision trees and gradient descent for learning, and are founded on basic logical principles like unification, constraints, satisfiability and induction. We compare the scopes of thes...
متن کاملJason Intentional Learning: An Operational Semantics
This paper introduces an operational semantics for defining Intentional Learning on Jason, the well known Java-based implementation of AgentSpeak(L). This semantics enables Jason to define agents capable of learning the reasons for adopting intentions based on their own experience. In this work, the use of the term Intentional Learning is strictly circumscribed to the practical rationality theo...
متن کامل